Linear Representation of Graphs: Applications to Molecular Graphs

نویسندگان

چکیده

In this article we build a linear representation starting from multigraph; allows us to give an algebraic view of the multigraph are studying. We show that two isomorphic multigraphs equivalent representations; conversely representations multigraphs. For clarity at beginning, classical results on representations, nevertheless these specific our graph representation.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automated Visual Representation of Linear Graphs

209 Visual representation of graphs is not essential to graph theory. However, the ability to model relationships pictorially has led to the use of graph theoretic techniques in many different applications. While computers normally work with a numeric represe ntation of a graph such as its incidence matrix, drawing a picture from such a representation is a very tedious process. Previous graph p...

متن کامل

An Algebraic Representation of Graphs and Applications to Graph Enumeration

We give a recursion formula to generate all the equivalence classes of connected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We use an algebraic graph representation to apply the result to the enumeration of connected graphs, all of whose biconnected components have the same number of vertices and edges. The proof uses Abel’s binomial theorem a...

متن کامل

Representation Learning on Graphs: Methods and Applications

Machine learning on graphs is an important and ubiquitous task with applications ranging from drug design to friendship recommendation in social networks. The primary challenge in this domain is finding a way to represent, or encode, graph structure so that it can be easily exploited by machine learning models. Traditionally, machine learning approaches relied on user-defined heuristics to extr...

متن کامل

commuting and non -commuting graphs of finit groups

فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...

15 صفحه اول

Linear-time Algorithm for Partial Representation Extension of Interval Graphs

Interval graphs are intersection graphs of closed intervals of the real-line. The wellknown computational problem, called recognition, asks for an input graph G whether it can be represented by closed intervals, i.e., whether G is an interval graph. There are several linear-time algorithms known for recognizing interval graphs. In this paper, we study a generalization of recognition, called par...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Match

سال: 2023

ISSN: ['0340-6253']

DOI: https://doi.org/10.46793/match.90-1.005a